Generating Parallel Plans Based on Planning Graph Analysis of Predicate/Transition Nets
نویسندگان
چکیده
Multi-agent systems often exhibit rich parallelism among agents. It is desirable in a multi-agent planner to explicitly represent parallel actions. This paper presents an approach for generating parallel execution plans based on the planning graph analysis. Instead of representing a planning problem by STRIPS operators, we model multi-agent planning domains using Predicate/Transition (PrT) nets (a high-level formalism of Petri nets), which are well suited for capturing dynamic behaviors of concurrent systems. We demonstrate that the planning graph analysis is adaptable for the analysis of PrT nets. Based on the planning graph analysis of a PrT net, a parallel plan with explicit representation of parallel actions can be automatically generated.
منابع مشابه
A Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملA Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملGenerating parallel plans satisfying multiple criteria in anytime fashion
We approach the problem of finding plans based on multiple optimization criteria from what would seem an unlikely direction: find one valid plan as quickly as possible, then stream essentially all plans that improve on the current best plan, searching over incrementally longer length plans. This approach would be computationally prohibitive for most planners, but we describe how, by using a con...
متن کاملA Graph-Partitioning Based Approach for Parallel Best-First Search
Parallel best-first search algorithms such as HDA* distribute work among the processes using a global hash function. Previous work distribution strategies seek to find a good walltime efficiency by reducing search overhead and/or communication overhead, but there was no unified, quantitative analysis on the effects of the methods on both overheads. We propose GRAZHDA*, a graph-partitioning base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002